Extreme Supermodular Set Functions over Ve Variables

نویسنده

  • Remco R. Bouckaert
چکیده

The class of supermodular functions on the power set of a non-empty nite set N forms a cone. It can be viewed as the direct sum of a linear subspace and of a cone of standardized supermodular functions which has nitely many extreme rays. Every extreme ray can be described by a standardized integer-valued set function. We analyse the situation in the case when N has ve elements (= variables). A computer program was used to obtain a catalogue of all classes of permutably equivalent extreme standardized supermodular functions on the power set of N. We consider several alternative ways of representation of these equivalence classes and use various characteristics to describe them. Moreover, two relevant hypotheses valid in case of four variables are disproved in case of ve variables.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supermodular Functions on Finite Lattices

The supermodular order on multivariate distributions has many applications in financial and actuarial mathematics. In the particular case of finite, discrete distributions, we generalize the order to distributions on finite lattices. In this setting, we focus on the generating cone of supermodular functions because the extreme rays of that cone (modulo the modular functions) can be used as test...

متن کامل

Supermodular functions and the complexity of MAX CSP

In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. An instance of Max CSP consists of a set of variables and a collection of constraints which are applied to certain specified subsets of these variables; the goal is to find values for the variables which maximize the number of simultaneously satisfied constraints. Usin...

متن کامل

Forthcoming in Discrete Optimization SUPERMODULAR COVERING KNAPSACK POLYTOPE

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...

متن کامل

Supermodular covering knapsack polytope

The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...

متن کامل

Core-based criterion for extreme supermodular functions

We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear equation system determined by the combinatorial core structure. This result allows us to characterize indecomposability in the class of generalized permutohedra. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000